On Completeness and Equivalence of Some Dynamic Priority Schemes
نویسندگان
چکیده
This paper identifies various parametrized dynamic priority queue disciplines from literature which are complete in two class M/G/1 queue. Equivalence between these queue disciplines is established by obtaining non linear transformation in closed form. Motivation behind these completeness and equivalence results is discussed from optimal control perspective. Some comments on global FCFS policy are made. Further, an alternative proof of optimality of c/ρ rule is given using completeness ideas. keywords: parametrized dynamic priority, optimal control, multi-class queue, achievable region
منابع مشابه
On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue
This paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/G/1 queue. An explicit one-to-one non linear transformation is obtained between earliest due date and delay dependent priority policy. Mean waiting time equivalence between thes...
متن کاملRemarks on completeness of lattice-valued Cauchy spaces
We study different completeness definitions for two categories of lattice-valued Cauchy spaces and the relations between these definitions. We also show the equivalence of a so-called completion axiom and the existence of a completion.
متن کاملDynamic equivalence relation on the fuzzy measure algebras
The main goal of the present paper is to extend classical results from the measure theory and dynamical systems to the fuzzy subset setting. In this paper, the notion of dynamic equivalence relation is introduced and then it is proved that this relation is an equivalence relation. Also, a new metric on the collection of all equivalence classes is introduced and it is proved that this metric is...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملSimulation and analysis of some dynamic priority schemes in two-class queues
In this paper, we analyse two important and relatively complex performance measures, tail probability and switching frequency, for two class queueing system with two different (relative and earliest due date based) dynamic priority schemes across classes. A simulator is build to perform such analysis and various observations are made. Based on computational evidence, it is conjectured that two ...
متن کامل